Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs

نویسندگان

  • Deborah Joseph
  • João Meidanis
  • Prasoon Tiwari
چکیده

Generating Sparse 2-Spanners p. 73 Low-Diameter Graph Decomposition is in NC p. 83 Parallel Algorithm for Cograph Recognition with Applications p. 94 Parallel Algorithms for All Minimum Link Paths and Link Center Problems p. 106 Optimal Multi-Packet Routing on the Torus p. 118 Parallel Algorithms for Priority Queue Operations p. 130 Heap Construction in the Parallel Comparison Tree Model p. 140 Efficient Rebalancing of Chromatic Search Trees p. 151 The Complexity of Scheduling Problems with Communication Delays for Trees p. 165 The List of Update Problem and the Retrieval of Sets p. 178 GKD-Trees: Binary Trees that Combine Multi-Dimensional Data Handling, Node Size, and Fringe Reorganization p. 192

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Level Boolean Minimization

mation and Management (AAIM), Portland, OR, USA, Lecture Notes in Computer Science, vol. 4508, pp. 399–410. Springer (2007) 12. Jiang, M.: A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model. In: Y.X. A.W.M. Dress, B. Zhu (eds.) Proc. 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA), Xi’an, China, Lecture Notes in Co...

متن کامل

Comparative Pathway Prediction with Structural Genomic Information via a Unified Graph Model

Template-based comparative analysis is a viable approach to the prediction of pathways in genomes. Methods based solely on sequence similarity may not be effective enough; structural information such as protein-DNA interactions and operons is useful in improving the prediction accuracy. In this paper, we present a novel approach to predicting pathways by seeking overall optimal sequence similar...

متن کامل

Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs

Given two independent sets I, J of a graph G, and imagine that a token (coin) is placed at each vertex of I. The Sliding Token problem asks if one could transform I to J via a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors so that the resulting set of vertices where tokens are placed remains independent. This problem is PSPACE-comp...

متن کامل

Comparative Pathway Annotation with Protein-DNA Interaction and Operon Information via Graph Tree Decomposition

Template-based comparative analysis is a viable approach to the prediction and annotation of pathways in genomes. Methods based solely on sequence similarity may not be effective enough; functional and structural information such as protein-DNA interactions and operons can prove useful in improving the prediction accuracy. In this paper, we present a novel approach to predicting pathways by see...

متن کامل

Uniquely Restricted Matchings in Interval Graphs

A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992